COVERAGE: verifying multiple-agent knowledge-based systems
نویسنده
چکیده
منابع مشابه
Verifying Multi-Agent Knowledge-Based Systems using COVERAGE
Anomaly detection, as performed by the COVER tool, has proven to be a useful method for verification of knowledge-based systems. The increasing development of distributed knowledge-based systems based upon the multi-agent architecture demands techniques for the verification of these systems. This paper describes the COVERAGE too1 -an extension of COVER designed to perform anomaly detection on m...
متن کاملAssessment of research systems in universal health coverage-related organizations
Background: Universal health coverage (UHC) is the desired goal of achieving universal access to health services without having to endure pain and financial difficulties. Multiple factors can help steer countries toward UHC. One of the most important factors is the production of valid quality evidence that can be achieved through research. The present study aimed at outlining...
متن کاملExtension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملDetecting Exceptions in Commitment Protocols: Discovering Hidden States
Open multiagent systems consist of autonomous agents that are built by different vendors. In principle, open multiagent systems cannot provide any guarantees about the behaviors of their agents. This means that when agents are working together, such as carrying out a business protocol, one agent’s misbehavior may potentially create an exception for another agent and obstruct its proper working....
متن کاملThe complexity of symbolic model checking temporal-epistemic logics
This paper presents complexity results for symbolic model checking for CTLK, a logic to reason about time and knowledge in multi-agent systems. We apply these results to investigate the complexity of verifying concurrent programs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Knowl.-Based Syst.
دوره 12 شماره
صفحات -
تاریخ انتشار 1999